O(1) query time algorithm for all pairs shortest distances on permutation graphs
نویسنده
چکیده
We present an algorithm for the all pairs shortest distance problem on permutation graphs. Given a permutation model for the graph on n vertices, after O(n) preprocessing the algorithm will deliver answers to distance queries in O(1) time. In the EREW PRAM model, preprocessing can be accomplished in O(log n) time with O(n) work. Where the distance between query vertices is k, a path can be delivered in O(k) time. The method is based on reduction to bipartite permutation graphs, a further reduction to unit interval graphs, and a coordinatization of unit interval graphs. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search
In this paper we address the problem of designing O(n) space representations for permutation and interval graphs that provide the neighborhood of any vertex in O(d) time, where d is its degree. To that purpose, we introduce a new parameter, called linearity, that would solve the problem if bounded for the two classes. Surprisingly, we show that it is not. Nevertheless, we design representations...
متن کاملDistance Oracles for Sparse Graphs
Suppose you are given a large network, such as the Internet or the US road network. In many practical applications, one might be interested in querying shortest path distances between pairs of nodes of the network. However, attempting to implement a data structure that supports such operations will result either in a large query time, or large space requirement, both of which are undesirable. I...
متن کاملFully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
This paper presents the first fully dynamic algorithms for maintaining all-pairs shortest paths in digraphs with positive integer weights less than b. For approximate shortest paths with an error factor of (2 + ), for any positive constant , the amortized update time isO(n2 log n= log logn); for an error factor of (1 + ) the amortized update time is O(n2 log3(bn)= 2). For exact shortest paths t...
متن کاملA new approach to all-pairs shortest paths on real-weighted graphs
We present a new all-pairs shortest path algorithm that works with real-weighted graphs in the traditional comparison-addition model. It runs in O(mn+n2 log log n) time, improving on the long-standing bound of O(mn + n2 logn) derived from an implementation of Dijkstra's algorithm with Fibonacci heaps. Here m and n are the number of edges and vertices, respectively. Our algorithm is rooted in th...
متن کاملTwo fast algorithms for all-pairs shortest paths
In a large, dense network, the computation of the ‘distances’, i.e., the shortest path lengths between all pairs of nodes, can take a long time with algorithms known from the literature. We present two all-pairs shortest path algorithms, based on the equations of Bellman. These algorithms run fast, much faster than indicated by their time complexity bound of O(n2m), where n is the number of nod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 155 شماره
صفحات -
تاریخ انتشار 2007